Unicast-based Characterization of Network Loss Topologies
نویسندگان
چکیده
| Current Internet transport protocols make end-to-end measurements and maintain perconnection state to regulate the use of shared network resources. When a number of such connections share a common endpoint, that endpoint has the opportunity to correlate these end-to-end measurements to better diagnose and control the use of shared resources. A valuable characterization of such shared resources is the \loss topology". From the perspective of a server with concurrent connections to multiple clients, the loss topology is a logical tree rooted at the server in which edges represent lossy paths between a pair of internal network nodes. We develop an end-to-end unicast packet probing technique and an associated analytical framework to: (1) infer loss topologies, (2) identify loss rates of links in an existing loss topology, and (3) augment a topology to incorporate the arrival of a new connection. Correct, eÆcient inference of loss topology information enables new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. Our extensive simulation results demonstrate that our approach is robust in terms of its accuracy and convergence over a wide range of network conditions.
منابع مشابه
Inferring Link Loss Rates from Unicast-Based End-to-End Measurement
In the Internet, because of huge scale and distributed administration, it is of practical importance to infer network-internal characteristics that cannot be measured directly. In this paper, based on a general framework we proposed previously, we present a feasible method of inferring packet loss rates of individual links from end-to-end measurement of unicast probe packets. Compared with meth...
متن کاملTopology Discovery on Unicast Networks: A Hierarchical Approach Based on End-to-End Measurements
In this paper we address the problem of topology discovery in unicast logical tree networks using endto-end measurements. Without any cooperation from the internal routers, topology estimation can be formulated as hierarchical clustering of the leaf nodes based on pair-wise correlations as similarity metrics. We investigate three types of similarity metrics: queueing delay measured by sandwich ...
متن کاملContent Distribution in Unicast Replica Meshes
We propose centralized algorithm of data distribution in the unicast p2p networks. Good example of such networks are meshes of WWW and FTP mirrors. Simulation of data propagation for different network topologies is performed and it is shown that proposed method performs up to 200% better then common approaches.
متن کاملMulti - Topology ( MT ) Routing in OSPF June 2007
This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Abstract This document describes an extension to Open Shortes...
متن کاملOptimal Coordination of Distance and Directional Overcurrent Relays Considering Different Network Topologies
Most studies in relay coordination have focused solely on coordination of overcurrent relays while distance relays are used as the main protection of transmission lines. Since, simultaneous coordination of these two types of relays can provide a better protection, in this paper, a new approach is proposed for simultaneous coordination of distance and directional overcurrent relays (D&DOCRs). Al...
متن کامل